Locally recoverable codes from rational maps
نویسندگان
چکیده
منابع مشابه
Locally Recoverable codes from rational maps
We point some contributions to the construction of Locally Recoverable codes from algebraic curves recently presented by A. Barg, I. Tamo and S. Vladut, that can lead to improvements concerning the definition, the parameters and the local recovering of these codes.
متن کاملOn Locally Recoverable (LRC) Codes
We present simple constructions of optimal erasure-correcting LRC codes by exhibiting their parity-check matrices. When the number of local parities in a parity group plus the number of global parities is smaller than the size of the parity group, the constructed codes are optimal with a field of size at least the length of the code. We can reduce the size of the field to at least the size of t...
متن کاملLocally recoverable codes from algebraic curves and surfaces
A locally recoverable code is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. Building on work of Barg, Tamo, and Vlăduţ, we present several constructions of locally recoverable codes from algebraic curves and surfaces.
متن کاملIntegrated interleaved codes as locally recoverable codes: properties and performance
Considerable interest has been paid in recent literature to codes combining local and global properties for erasure correction. Applications are in cloud type of implementations, in which fast recovery of a failed storage device is important, but additional protection is required in order to avoid data loss, and in RAID type of architectures, in which total device failures coexist with silent f...
متن کاملRegenerating Codes and Locally Recoverable Codes for Distributed Storage Systems
We survey the recent results on applying error control coding to distributed storage systems. In such systems, errors often happen in a burst manner, or maybe only one storage node in the whole distributed system fails. Therefore, only a small amount of information, e.g., one data fragment, has to be recovered. Therefore, accessing the whole data is unnecessary. Especially, we focus on regenera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2018
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2018.07.005